Opening Statistics and Match Play for Backgammon Games
نویسندگان
چکیده
Players of complex board games like backgammon, chess and go, were always wondering what the best opening moves for their favourite game are. In the last decade, computer analysis has offered more insight to many opening variations. This is especially true for backgammon, where computer rollouts have radically changed the way human experts play the opening. In this paper we use Palamedes, the winner of the latest computer backgammon Olympiad, to make the first ever computer assisted analysis of the opening rolls for the backgammon variants Portes, Plakoto and Fevga (collectively called Tavli in Greece). We then use these results to build effective match strategies for each game variant.
منابع مشابه
A 'Neural' Network that Learns to Play Backgammon
We describe a class of connectionist networks that have learned to play backgammon at an intermediate-to-advanced level. TIle networks were trained by a supervised learning procedure on a large set of sample positions evaluated by a human expert. In actual match play against humans and conventional computer programs, the networks demonstrate substantial ability to generalize on the basis of exp...
متن کاملAchieving Efficient and Cognitively Plausible Learning in Backgammon
Traditionally, computer applications to game domains have taken a brute-force approach, relying on sheer computational power to overcome the complexity of the domain. Although many of these programs have been quite successful, it is interesting to note that humans can still perform extremely well against them. Thus we are compelled to ask, if no human could match the computational power of most...
متن کاملDeveloping a New Java Algorithm for Playing Backgammon
A computer game is a very convenient way of recreation. In order to simulate most classical games, many algorithms have been implemented. The complexity of algorithms used in implementing the games leads to a continuous increasing of the computer performance. The application presented in this paper is able to play backgammon. The software allows a game between two players and also a game betwee...
متن کامل*-Minimax Performance in Backgammon
This paper presents the first performance results for Ballard’s *-Minimax algorithms applied to a real–world domain: backgammon. It is shown that with effective move ordering and probing the Star2 algorithm considerably outperforms Expectimax. Star2 allows strong backgammon programs to conduct depth 5 full-width searches (up from 3) under tournament conditions on regular hardware without using ...
متن کاملImproving Temporal Difference Learning Performance in Backgammon Variants
Palamedes is an ongoing project for building expert playing bots that can play backgammon variants. As in all successful modern backgammon programs, it is based on neural networks trained using temporal difference learning. This paper improves upon the training method that we used in our previous approach for the two backgammon variants popular in Greece and neighboring countries, Plakoto and F...
متن کامل